Automatic Generation System for Multiple-Valued Galois-Field Parallel Multipliers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Generation System for Multiple-Valued Galois-Field Parallel Multipliers

This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p ≥ 3) arithmetic circuits, which can be efficiently implemented by mult...

متن کامل

Current-mode Multipliers for Multiple-valued Logic and Residue Number System Arithmetic

− This paper presents new structures of multipliers based on the current mode gates – digital elements operating with constant, continuous power supply current. Designed multipliers are destined for use in N-radix and modulo N arithmetic units. Proposed structures are simple and regular, and are based on the modulo N adders. All proposed structures were successfully tested in the SPICE simulator.

متن کامل

Automatic Generation of a Multi Agent System for Crisis Management by a Model Driven Approach

Considering the increasing occurrences of unexpected events and the need for pre-crisis planning in order to reduce risks and losses, modeling instant response environments is needed more than ever. Modeling may lead to more careful planning for crisis-response operations, such as team formation, task assignment, and doing the task by teams. A common challenge in this way is that the model shou...

متن کامل

Efficient Gröbner basis reductions for formal verification of galois field multipliers

Galois field arithmetic finds application in many areas, such as cryptography, error correction codes, signal processing, etc. Multiplication lies at the core of most Galois field computations. This paper addresses the problem of formal verification of hardware implementations of (modulo) multipliers over Galois fields of the type F2k , using a computeralgebra/algebraic-geometry based approach....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2017

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.2016lop0010